Double bubble minimizes: Interval computations help in solving a long-standing geometric problem

نویسنده

  • Vladik Kreinovich
چکیده

Main result. It is well known that of all surfaces surrounding an area with a given volume V, the sphere has the smallest area. This result explains, e.g., why a soap bubble tends to become a sphere. More than a hundred years ago, the Belgian physicist J. Plateaux asked a similar question: what is the least area surface enclosing two equal volumes? Physical experiments with bubbles seem to indicate that the desired least area surface is a double bubble, a surface formed by two spheres (separated by a flat disk) that meet along a circle at an angle of 120 °. However, until 1995, it was not clear whether this is really the desired least area surface. Several other surfaces ('torus bubbles") have been proposed whose areas are pretty close to the area of the double bubble. The theorem that double bubble really minimizes was recently proven by Joel Hass from Department of Mathematics, University of California at Davis (email hass©ma'gh.ucdavis, edu) and Roger Schlafly from the ReaI Software Co. ( r sch ia :E ly la t tma i l . corn). First, they proved that the desired surface is either a double bubble or a torus bubble, and then used interval computations (as welt as other ingenious numerical techniques) to prove that for all possible values of parameters, the area of the torus bubble exceeds the area of the double bubble described above. This result was mentioned in a popular magazine Discover as one of the main scientific achievements of the year. This application of interval mathematics not only provides a solution to a long-standing mathematical problem; the authors also describe potential practical applications, one of" the them: to the design of the lightest possible double fuel tanks for r(~ckets. The paper is not yet published. A preprint is available from the authors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems

Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...

متن کامل

A New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints

Most research on bilevel linear programming problem  is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...

متن کامل

A new solving approach for fuzzy flexible programming problem in uncertainty conditions

Modeling and solving real world problems is one of the most important issues in optimization problems. In this paper, we present an approach to solve Fuzzy Interval Flexible Linear Programming (FIFLP) problems that simultaneously have the interval ambiguity in the matrix of coefficients .In the first step, using the interval problem solving techniques; we transform the fuzzy interval flexible p...

متن کامل

Generalized iterative methods for solving double saddle point problem

In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version  of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...

متن کامل

Solving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times

Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Reliable Computing

دوره 2  شماره 

صفحات  -

تاریخ انتشار 1996